Online Packet Routing on Linear Arrays and Rings
نویسنده
چکیده
In contrast to classical offline k-k routing, the online packet routing problem allows for an arbitrary number of packets with arbitrary end points and release times. We study this problem on linear array and ring networks. We generalize an earlier result for the offline problem by showing that Farthest First (FF) scheduling is optimal with respect to makespan on linear arrays. We also show that two other algorithms (Longest in System (LIS) and Moving Priority (MP)) have competitive ratio 2 with respect to makespan on linear arrays. For bidirectional rings, we show that, the competitive ratio of shortest path routing combined with LIS or MP scheduling is in [2.5, 3) and the competitive ratio of shortest path routing combined with FF scheduling is 2. The latter algorithm is optimal among deterministic memoryless algorithms and all algorithms of which we are aware in the literature.
منابع مشابه
Packet Routing and Information Gathering in Lines, Rings and Trees
We study the problem of online packet routing and information gathering in lines, rings and trees. A network consists of n nodes. At each node there is a buffer of size B. Each buffer can transmit one packet to the next buffer at each time step. The packets injection is under adversarial control. Packets arriving at a full buffer must be discarded. In information gathering all packets have the ...
متن کاملInteger Sorting and Routing in Arrays with Reconfigurable Optical Buses
In this paper we present deterministic algorithms for integer sorting and on-line packet routing on arrays with reconngurable optical buses. The main objective is to identify the mechanisms speciic to this type of architectures that allow us to build eecient integer sorting, partial permutation routing and h-relations algorithms. The consequences of these results on the PRAM simulation complexi...
متن کاملModeling of VANET Technology & Ad-Hoc Routing Protocols Based on High Performance Random Waypoint Models
Today, one of the new technologies in the modern era is Vehicular Ad-hoc Network which has takenenormous attention in the recent years. Because of rapid topology changing and frequent disconnectionmakes it difficult to design an efficient routing protocol for routing data between vehicles, called V2V orvehicle to vehicle communication and vehicle to roadside infrastructure, called V2I. Designin...
متن کاملOptimal Routing for Minimum Wavelength Requirements in End-to-End Optical Burst Switching Rings
A novel routing and link dimensioning optimisation method which minimises the total wavelength requirements of dynamic optical WDM rings the most popular topology in metropolitan networksis proposed. The method finds the solution (set of routes) of minimum cost by solving an integer linear optimisation problem. Contrary to the common belief, results show that the optimal routes found by the pro...
متن کاملA Secure Routing Algorithm for Underwater Wireless Sensor Networks
Recently, underwater Wireless Sensor Networks (UWSNs) attracted the interest of many researchers and the past three decades have held the rapid progress of underwater acoustic communication. One of the major problems in UWSNs is how to transfer data from the mobile node to the base stations and choosing the optimized route for data transmission. Secure routing in UWSNs is necessary for packet d...
متن کامل